Regular Languages Accepted by Quantum Automata

Languages Accepted by Integer Weighted Finite Automata

We study the family of languages accepted by the integer weighted nite automata. Especially the closure properties of this family are investigated.

Semilinearity and Context-Freeness of Languages Accepted by Valence Automata

Valence automata are a generalization of various models of automata with storage. Here, each edge carries, in addition to an input word, an element of a monoid. A computation is considered valid if multiplying the monoid elements on the visited edges yields the identity element. By choosing suitable monoids, a variety of automata models can be obtained as special valence automata. This work is ...

Single letter languages accepted by alternating and probabilistic pushdown automata

We consider way k tape alternating pushdown automata k apa and way k tape alternating nite automata k afa We say that an alternating automaton accepts a language L with f n bounded maximal respectively minimal leaf size if arbitrary re spectively at least one accepting tree for any w L has no more than f jwj leaves The main results of the article are the following For way k tape alternating cou...

Small size quantum automata recognizing some regular languages

Given a class {p | ∈ I } of stochastic events induced byM-state 1-way quantum finite automata (1qfa) on alphabet , we investigate the size (number of states) of 1qfa’s that -approximate a convex linear combination of {p | ∈ I }, and we apply the results to the synthesis of small size 1qfa’s. We obtain: • An O((Md/ 3) log2(d/ 2)) general size bound, where d is the Vapnik dimension of {p (w) | w ...

Regular Languages and Finite Automata